Scalar Ambiguity and Freeness in Matrix Semigroups over Bounded Languages
نویسندگان
چکیده
There has been much research into freeness properties of finitely generated matrix semigroups under various constraints, mainly related to the dimensions of the generator matrices and the semiring over which the matrices are defined. A recent paper has also investigated freeness properties of matrices within a bounded language of matrices, which are of the form M1M2 · · ·Mk ⊆ Fn×n for some semiring F [9]. Most freeness problems have been shown to be undecidable starting from dimension three, even for upper-triangular matrices over the natural numbers. There are many open problems still remaining in dimension two. We introduce a notion of freeness and ambiguity for scalar reachability problems in matrix semigroups and bounded languages of matrices. Scalar reachability concerns the set {ρMτ |M ∈ S}, where ρ, τ ∈ F are vectors and S is a finitely generated matrix semigroup. Ambiguity and freeness problems are defined in terms of uniqueness of factorizations leading to each scalar. We show various undecidability results.
منابع مشابه
The freeness problem over matrix semigroups and bounded languages
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2 × 2 matrices with rational entries when the products are restricted to certain bounded languages. We also show that this problem becomes undecidable for sufficiently large matrices.
متن کاملThe freeness problem for products of matrices defined on bounded languages
We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2×2 matrices with rational entries when the products are restricted to certain bounded languages. We also show that this problem becomes undecidable for large enough matrices. The full version of this work was accepted for publication in Information and Computation. It is ava...
متن کاملA ug 2 00 8 On the decidability of semigroup freeness ∗
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness pr...
متن کاملOn the decidability of semigroup freeness
This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X ⊆ S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness pr...
متن کاملComputational problems in matrix semigroups
This thesis deals with computational problems that are defined on matrix semigroups, which play a pivotal role in Mathematics and Computer Science in such areas as control theory, dynamical systems, hybrid systems, computational geometry and both classical and quantum computing to name but a few. Properties that researchers wish to study in such fields often turn out to be questions regarding t...
متن کامل